Algebraic Structures of Programs: First Steps to Algebraic Programming
نویسنده
چکیده
Basic algebraic notions are introduced which can be used to describe and to transform program-data complexes for traditional languages, restricted computation, non-numeric computation and modeling. General algebraic program systems (GAPS) are free of assumptions what computing (programming) systems have as their particular constructs. First of all we argue why current technique is sometimes not adequate. Then we show how to interpret notions of abstract algebra (groupoid structure) as super-von Neumann computational structure and how to express many useful structures and notions in an algebra. Then GAPS are introduced and basic mathematical results are stated including the precise criterion when a given system of actions over programs can be added to given programming language. Various examples of GAPS are given. And at last we show possible primitives of ‘structured algebraic modeling’ (programming).
منابع مشابه
Algebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملMAGMA-JOINED-MAGMAS: A CLASS OF NEW ALGEBRAIC STRUCTURES
By left magma-$e$-magma, I mean a set containingthe fixed element $e$, and equipped by two binary operations "$cdot$", $odot$ with the property $eodot (xcdot y)=eodot(xodot y)$, namelyleft $e$-join law. So, $(X,cdot,e,odot)$ is a left magma-$e$-magmaif and only if $(X,cdot)$, $(X,odot)$ are magmas (groupoids), $ein X$ and the left $e$-join law holds.Right (and two-sided) magma-$e$-magmas are de...
متن کاملSOME HYPER K-ALGEBRAIC STRUCTURES INDUCED BY MAX-MIN GENERAL FUZZY AUTOMATA
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...
متن کاملAlgebraic Frameworks for Probabilistic and Concurrent Systems
Formal methods have been extensively used and studied in the area of theoretical computer science ultimately with the aim of providing the technical foundations to justify design methods for producing high quality software systems. Formal methods provide a way to write specifications of required behaviour together with rules to check that the implementation’s behaviour is consistent with that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014